Diameter of paired domination edge-critical graphs

نویسندگان

  • Michelle Edwards
  • Richard G. Gibson
  • Michael A. Henning
  • Christina M. Mynhardt
چکیده

A paired dominating set of a graph G without isolated vertices is a dominating set of G whose induced subgraph has a perfect matching. The paired domination number γpr(G) of G is the minimum cardinality amongst all paired dominating sets of G. The graph G is paired domination edge-critical (γprEC) if for every e ∈ E(G), γpr(G+ e) < γpr(G). We investigate the diameter of γprEC graphs. To this effect we characterize γprEC trees. We show that for arbitrary even k ≥ 4 there exists a kprEC graph with diameter two. We provide an example which shows that the maximum diameter of a kprEC graph is at least k− 2 and prove that it is at most min{2k − 6, 3k/2 + 3}. ∗ Recipient of an Undergraduate Student Research Award from the Canadian National Science and Engineering Research Council, Summer 2006. Current address: Department of Mathematics, Simon Fraser University, Burnaby, BC, Canada V5A1S6. [email protected] † Research supported in part by the South African National Research Foundation and the University of KwaZulu-Natal. ‡ Research supported by the Natural Sciences and Engineering Research Council of Canada. 280 EDWARDS, GIBSON, HENNING AND MYNHARDT

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Total Domination Edge Critical Graphs with Maximum Diameter

Denote the total domination number of a graph G by γt(G). A graph G is said to be total domination edge critical, or simply γtcritical, if γt(G + e) < γt(G) for each edge e ∈ E(G). For 3t-critical graphs G, that is, γt-critical graphs with γt(G) = 3, the diameter of G is either 2 or 3. We characterise the 3t-critical graphs G with diam G = 3.

متن کامل

On the signed Roman edge k-domination in graphs

Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...

متن کامل

On the diameter of a domination dot-critical graph

A graph G is domination dot-critical, or just dot-critical, if contracting any edge decreases the domination number. It is totally dot-critical if identifying any twovertices decreases the domination number. In this paper, we study an open question concerning of the diameter of a domination dot-critical graph G. © 2008 Elsevier B.V. All rights reserved.

متن کامل

On a Family of 4-Critical Graphs with Diameter Three

Let γt(G) denote the total domination number of the graph G. G is said to be total domination edge critical, or simply γt-critical, if γt(G+ e) < γt(G) for each edge e ∈ E(G). In this paper we study a family H of 4-critical graphs with diameter three, in which every vertex is a diametrical vertex, and every diametrical pair dominates the graph. We also generalize the self-complementary graphs, ...

متن کامل

Coverings, matchings and paired domination in fuzzy graphs using strong arcs

The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2008